Parallel Optimization of String Mode Matching Algorithm Based on Multi-Core Computing
نویسندگان
چکیده
منابع مشابه
Optimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کاملoptimization of agricultural bmps using a parallel computing based multi-objective optimization algorithm
beneficial management practices (bmps) are important measures for reducing agricultural non-point source (nps) pollution. however, selection of bmps for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. due to its iterative nature, the optimization typically takes a long time to achieve the bmp trade-off results which is not desirable ...
متن کاملAn Efficient Parallel String Matching Algorithm Based on DFA
The classical string matching algorithms are facing a great challenge on speed due to the rapid growth of information on Internet. Meanwhile, multicore CPU has been widespread on computers. But classical string matching algorithms does not apply to multi-core CPU flexibly. It not only affects the run-time speed, but also makes a waste of the resource on CPU. In this paper, we proposed a paralle...
متن کاملParallel Ant Colony Optimization Algorithm on a Multi-core Processor
This paper proposes parallelization methods of ACO algorithms on a computing platform with a multi-core processor aiming at fast execution to find acceptable solutions. As an ACO algorithm, we use the cunning Ant System and test on several sizes of TSP instances. As the parallelization method, we use agent level parallelization in one colony using Java thread programming. According to the synch...
متن کاملDerivation of a parallel string matching algorithm
We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths. The theory of powerlists [2, 3] is central to the development of the algorithm and its algebraic manipulations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Software Engineering
سال: 2015
ISSN: 1819-4311
DOI: 10.3923/jse.2015.383.391